Global stability of Nash equilibrium in Aggregative Games
نویسندگان
چکیده
If an aggregative game satisfies the generalized Hahn conditions, then there exists a unique Nash equilibrium, which may not be interior and is globally stable under two alternative continuous adjustment processes with non-negativity constraints. JEL Classification Numbers: C72, D43, L13.
منابع مشابه
Global Stability of Nash Equilibrium in Submodular Aggregative Games*
If an aggregative game satisfies the generalized Hahn conditions, then there exists a unique Nash equilibrium which may not be interior and is globally asymptotically stable under two alternative continuous adjustment processes with non-negativity constraints. JEL Classification Numbers: C72, D43, L13.
متن کاملLocal Aggregative Games
Aggregative games provide a rich abstraction to model strategic multi-agent interactions. We introduce local aggregative games, where the payoff of each player is a function of its own action and the aggregate behavior of its neighbors in a connected digraph. We show the existence of pure strategy -Nash equilibrium in such games when the payoff functions are convex or sub-modular. We prove an i...
متن کاملProjected-gradient algorithms for generalized equilibrium seeking in Aggregative Games are preconditioned Forward-Backward methods
We show that projected-gradient methods for the distributed computation of generalized Nash equilibria in aggregative games are preconditioned forward-backward splitting methods applied to the KKT operator of the game. Specifically, we adopt the preconditioned forward-backward design, recently conceived by Yi and Pavel in the manuscript “A distributed primal-dual algorithm for computation of ge...
متن کاملNon-differentiability of Payoff Functions and Non-uniqueness of Nash Equilibria
Given non-degenerate intervals X of R and an increasing ordered mapping Φ : X × · · · ×X → R , games in strategic form between N players with the X as action sets with the following three properties are studied: the set of Nash equilibria E is convex, Φ is constant on E and in each Nash equilibrium at least one payoff function is not partially differentiable w.r.t. its own action. The results a...
متن کاملA Douglas-Rachford splitting for semi-decentralized generalized Nash equilibrium seeking in Monotone Aggregative Games
We address the generalized Nash equilibrium seeking problem for noncooperative agents playing non-strictly monotone aggregative games with affine coupling constraints. First, we use operator theory to characterize the generalized Nash equilibria of the game as the zeros of a monotone setvalued operator. Then, we massage the Douglas–Rachford splitting to solve the monotone inclusion problem and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IGTR
دوره 16 شماره
صفحات -
تاریخ انتشار 2014